Polygon Nesting and Robustness
نویسندگان
چکیده
منابع مشابه
Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem
This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a metaheuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in ...
متن کاملApplying Evolutionary Algorithms and the No Fit Polygon to the a Nesting Problem
In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with t...
متن کاملFast neighborhood search for two- and three-dimensional nesting problems
In this paper we present a new heuristic solution method for two-dimensional nesting problems. It is based on a simple local search scheme in which the neighborhood is any horizontal or vertical translation of a given polygon from its current position. To escape local minima we apply the meta-heuristic method Guided Local Search. The strength of our solution method comes from a new algorithm wh...
متن کاملApplying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant a...
متن کاملSolving Nesting Problems with Non-Convex Polygons by Constraint Logic Programming
In this paper an application of constraint logic programming (CLP) to the resolution of nesting problems is presented. Nesting problems are a special case of the cutting and packing problems, in which the pieces generally have non-convex shapes. Due to their combinatorial optimization nature, nesting problems have traditionally been tackled by heuristics and in the recent past by meta-heuristic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 1990